Asymptotic Formulae for Partition Ranks
نویسندگان
چکیده
Using an extension of Wright’s version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.
منابع مشابه
Estimation in ARMA models based on signed ranks
In this paper we develop an asymptotic theory for estimation based on signed ranks in the ARMA model when the innovation density is symmetrical. We provide two classes of estimators and we establish their asymptotic normality with the help of the asymptotic properties for serial signed rank statistics. Finally, we compare our procedure to the one of least-squares, and we illustrate the performa...
متن کاملAsymptotics for Rank Partition Functions
In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.
متن کاملSampling formulae arising from random Dirichlet populations
Consider the random Dirichlet partition of the interval into n fragments at temperature θ > 0. Some statistical features of this random discrete distribution are recalled, together with explicit results on the law of its size-biased permutation. Using these, pre-asymptotic versions of the Ewens and Donnelly-Tavaré-Griffiths sampling formulae from finite Dirichlet partitions are computed exactly...
متن کاملTHE f(q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS
In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtaining formulas for Ne(n) (resp. No(n)), the number of partitions of n with even (resp. odd) rank. Thanks to Rademacher’s celebrated formula for the partition function, this problem is equivalent to that of obtaining a formula for the coefficients of the mock theta function f(q),...
متن کاملInequalities Between Ranks and Cranks
Higher moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves the first several cases of (and strengthens) a conjecture due to Garvan, which states that the moments of the crank function are always larger than the moments of the crank f...
متن کامل